719A - Vitya in the Countryside - CodeForces Solution


implementation *1100

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long n;
    cin>>n;
    vector<long long>v(n);
    for(int i=0;i<n;i++) cin>>v[i];

    long long check=0;
    if(n==1)
    {
        if(v[0]==0)
            cout<<"UP"<<endl;
            else if(v[0]==15)
                cout<<"DOWN"<<endl;
        else
            cout<<-1<<endl;
    }
    else
    {
        if(v[n-1]==15)
            cout<<"DOWN"<<endl;
        else if(v[n-1]==0)
            cout<<"UP"<<endl;
        else if(v[n-1]>v[n-2])
        {
            cout<<"UP"<<endl;

        }

         else if(v[n-1]<v[n-2])
        {
            cout<<"DOWN"<<endl;

        }
    }
}


Comments

Submit
0 Comments
More Questions

237A - Free Cash
1615B - And It's Non-Zero
1619E - MEX and Increments
34B - Sale
1436A - Reorder
1363C - Game On Leaves
1373C - Pluses and Minuses
1173B - Nauuo and Chess
318B - Strings of Power
1625A - Ancient Civilization
864A - Fair Game
1663B - Mike's Sequence
448A - Rewards
1622A - Construct a Rectangle
1620A - Equal or Not Equal
1517A - Sum of 2050
620A - Professor GukiZ's Robot
1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two
812C - Sagheer and Nubian Market
272A - Dima and Friends
1352C - K-th Not Divisible by n
545C - Woodcutters
1528B - Kavi on Pairing Duty
339B - Xenia and Ringroad
189A - Cut Ribbon
1182A - Filling Shapes